Diophantine approximation with mild divisibility constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Diophantine Problem for Addition and Divisibility

An algorithm is given for deciding existential formulas involving addition and the divisibility relation over the natural numbers. In this paper it will be shown that there is an algorithm for deciding formulas of the form k 0) 3x,.3x„6N A /,(*.,..., xn)\g¡(xx, ...,xtt) /-I in N (the natural numbers), where the / and g¡ are linear polynomials with integer coefficients. (a\b means "a divides b"....

متن کامل

Diophantine approximation and Diophantine equations

The first course is devoted to the basic setup of Diophantine approximation: we start with rational approximation to a single real number. Firstly, positive results tell us that a real number x has “good” rational approximation p/q, where “good” is when one compares |x − p/q| and q. We discuss Dirichlet’s result in 1842 (see [6] Course N◦2 §2.1) and the Markoff–Lagrange spectrum ([6] Course N◦1...

متن کامل

Multiplicative Diophantine approximation

In his paper, Dirichlet gives a complete proof for n = 1 and observes that this proof can be easily extended to arbitrary values of n. Good references on this topic are Chapter II of [52] and Cassels’ book [17]. There are in the literature many papers on various generalisations of the Dirichlet Theorem and on closely related problems. A typical question asks whether for a given set of mn real n...

متن کامل

Introduction to Diophantine Approximation

In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y) of the inequality |xθ − y| ¬ 1/x, where θ is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the inequality has infinitely many solutions by continued fractions. F...

متن کامل

Dynamical Diophantine Approximation

Let μ be a Gibbs measure of the doubling map T of the circle. For a μ-generic point x and a given sequence {rn} ⊂ R, consider the intervals (T x − rn (mod 1), T x + rn (mod 1)). In analogy to the classical Dvoretzky covering of the circle we study the covering properties of this sequence of intervals. This study is closely related to the local entropy function of the Gibbs measure and to hittin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2006

ISSN: 0022-314X

DOI: 10.1016/j.jnt.2005.08.001